We present our approach to real-time service-oriented scheduling problems with the objective of maximizing the total system\r\nutility. Different from the traditional utility accrual scheduling problems that each task is associated with only a single time utility\r\nfunction (TUF), we associate two different TUFsââ?¬â?a profit TUF and a penalty TUFââ?¬â?with each task, to model the real-time services\r\nthat not only need to reward the early completions but also need to penalize the abortions or deadline misses. The scheduling\r\nheuristics we proposed in this paper judiciously accept, schedule, and abort real-time services when necessary to maximize the\r\naccrued utility. Our extensive experimental results show that our proposed algorithms can significantly outperform the traditional\r\nscheduling algorithms such as the Earliest Deadline First (EDF), the traditional utility accrual (UA) scheduling algorithms, and an\r\nearlier scheduling approach based on a similar model.
Loading....